A projection method for nonlinear eigenvalue problems using contour integrals
نویسندگان
چکیده
منابع مشابه
Nonlinear eigenvalue problems and contour integrals
Beyn’s algorithm for solving nonlinear eigenvalue problems is given a new interpretation and a variant is designed in which the required information is extracted via the canonical polyadic decomposition of a Hankel tensor. A numerical example shows that the choice of the filter function is very important, particularly with respect to where it is positioned in the complex plane.
متن کاملA Jacobi-Davidson-type projection method for nonlinear eigenvalue problems
This article discusses a projection method for nonlinear eigenvalue problems. The subspace of approximants is constructed by a Jacobi–Davidson type approach, and the arising eigenproblems of small dimension are solved by safeguarded iteration. The method is applied to a rational eigenvalue problem governing the vibrations of tube bundle immersed in an inviscid compressible fluid.
متن کاملA numerical method for polynomial eigenvalue problems using contour integral
We propose a numerical method using contour integral to solve polynomial eigenvalue problems (PEPs). The method finds eigenvalues contained in a certain domain which is defined by a surrounding integral path. By evaluating the contour integral numerically along the path, the method reduces the original PEP into a small generalized eigenvalue problem, which has the identical eigenvalues in the d...
متن کاملA projection method for generalized eigenvalue problems
In this paper, we propose a method for finding certain eigenvalues of a generalized eigenvalue problem that lie in a given domain of the complex plane. The proposed method projects the matrix pencil onto a subspace associated with the eigenvalues that are located in the domain via numerical integration. The projection produces a small pencil with Hankel matrices.
متن کاملProjection Methods for Nonlinear Sparse Eigenvalue Problems
This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2013
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.5.41